Synthesis of winning attacks on communication protocols using supervisory control theory: two case studies

There is an increasing need to study the vulnerability of communication protocols in distributed systems malicious attacks that attempt violate properties such as safety or nonblockingness. In this paper, we propose a common methodology for formal synthesis successful against two well-known protocols, Alternating Bit Protocol (ABP) and Transmission Control (TCP), where attacker can always eventually win, called For-all attacks. This extends previous work on There-exists TCP, sometimes win. We model ABP TCP system architecture by finite-state automata employ supervisory control theory discrete event pose solve attacks, has partial observability controllability events. consider several scenarios person-in-the-middle present results attack using our each case.